On irregular total labellings
نویسندگان
چکیده
Two new graph characteristics, the total vertex irregularity strength and the total edge irregularity strength, are introduced. Estimations on these parameters are obtained. For some families of graphs the precise values of these parameters are proved. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Edge-Injective and Edge-Surjective Vertex Labellings
For a graph G = (V,E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is injective or surjective or both. We study the relation between these labellings and the number theoretic notions of an additive basis and a Sidon set, present a new construction for a so-called restricted additive basis and d...
متن کاملIrregular Labellings of Circulant Graphs
We investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(G)) of circulant graphs Cin(1, 2, . . . , k) and prove that tvs(Cin(1, 2, . . . , k)) = ⌈ n+2k 2k+1 ⌉ , while s(Cin(1, 2, . . . , k)) = ⌈ n+2k−1 2k ⌉ except if either n = 2k + 1 or if k is odd and n ≡ 2k + 1(mod4k), then s(Cin(1, 2, . . . , k)) = ⌈ n+2k−1 2k ⌉ + 1.
متن کاملSome totally modular cordial graphs
In this paper we define total magic cordial (TMC) and total sequential cordial (TSC) labellings which are weaker versions of magic and simply sequential labellings of graphs. Based on these definitions we have given several results on TMC and TSC graphs.
متن کاملConnections between labellings of trees
There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.
متن کاملEdge irregular total labellings for graphs of linear size
Confirming a conjecture by Ivančo and Jendrol’ for a large class of graphs we prove that for every graph G = (V,E) of order n, size m and maximum degree ∆ with m > 111000∆ there is a function f : V ∪ E → { 1, 2, ..., ⌈ m+2 3 ⌉} such that f(u) + f(uv) + f(v) 6= f(u′) + f(u′v′) + f(v′) for every uv, u′v′ ∈ E with uv 6= u′v′. Furthermore, we prove the existence of such a function with values up to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007